Heuristic Search Procedures for Cryptanalysis and Development of Enhanced Cryptographic Techniques
نویسنده
چکیده
Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Cryptographic techniques currently being utilized in the field of communication. This paper presents an approach for the heuristic search procedures for cryptanalysis and development of enhanced cryptographic techniques. To implement the proposed Tabu search, Genetic, and Simulated Annealing algorithms firstly by utilising cipher text as well as some plain text and secondly by using only the cipher text to retrieve the original data. The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. The goal of this paper is to comparison between Tabu Search, Genetic Algorithm and simulated annealing were made in order to investigate the performance for the cryptanalysis on SDES. The methods were tested and extensive computational results show that Tabu Search algorithm performs better than Genetic algorithm and simulated annealing for such type of NP-Hard combinatorial problem.
منابع مشابه
A Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...
متن کاملA Comparison between Different Meta-Heuristic Techniques in Power Allocation for Physical Layer Security
Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper&rsqu...
متن کاملHeuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates
Differential and linear cryptanalysis are the general purpose tools to analyze various cryptographic primitives. Both techniques have in common that they rely on the existence of good differential or linear characteristics. The difficulty of finding such characteristics depends on the primitive. For instance, AES is designed to be resistant against differential and linear attacks and therefore,...
متن کاملCryptanalysis of matrix conjugation schemes
In this paper we cryptanalyze two protocols: GrigorievShpilrain authentication protocol and Wang et al. public key encryption protocols that use computational hardness of some variations of the conjugacy search problem in noncommutative monoids. We devise a practical heuristic algorithm solving those problems. As a conclusion we claim that these protocols are insecure for the proposed parameter...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کامل